Optimal Stable Nonlinear Approximation

نویسندگان

چکیده

While it is well-known that nonlinear methods of approximation can often perform dramatically better than linear methods, there are still questions on how to measure the optimal performance possible for such methods. This paper studies compatible with numerical implementation in they required be numerically stable. A performance, called stable manifold widths, approximating a model class K Banach space X by introduced. Fundamental inequalities between these widths and entropy established. The effects requiring stability settings deep learning compressed sensing discussed.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Rational Approximation of Nonlinear Optimal Control Problems

In this paper rational approximation of solutions to nonlinear optimal control problems is considered. A computational procedure is presented that makes it possible to compute a rational function that approximates the true optimal cost function. It is shown that the rational function has the same series expansion around the origin as the true solution. Finally, two examples are given that compa...

متن کامل

Frequency-weighted optimal Hankel-norm approximation of stable transfer functions

The present paper presents a method of frequency shaping the error obtained by performing an optimal Hankel-norm approximation of a scalar, finite-dimensional, linear, time-invariant system. The optimal Hankel-norm approximation procedure finds a transfer function (or transfer function matrix) of prescribed order which approximates a given transfer function (or transfer function matrix) of grea...

متن کامل

The Viterbi Optimal Runlength-Constrained Approximation Nonlinear Filter

Simple nonlinear lters are often used to enforce \hard" syntactic constraints while remaining close to the observation data; e.g., in the binary case it is common practice to employ iterations of a suitable median, or a one-pass recursive median, openclose, or closopen lter to impose a minimum symbol run-length constraint while remaining \faithful" to the observation. Unfortunately , these lter...

متن کامل

Successive Collocation: An Approximation to Optimal Nonlinear Control

A novel approach to solving the optimal nonlin-ear control problem is presented. Instead of seeking a global approximation to the Hamilton-Jacobi-Bellman equation, a local approximation is obtained by successively solving the Generalized Hamilton-Jacobi-Bellman (GHJB) equation on a local region of the state space. The optimal control is generated by solving the GHJB equation algebraically at se...

متن کامل

Successive Galerkin Approximation of Nonlinear Optimal Attitude Control

This paper presents the application of the Successive Galerkin Approximation (SGA) to the Hamilton-Jacobi-Bellman equation to obtain solutions of the optimal attitude control problem. Galerkin's method approximates the value function by a truncated Galerkin series expansion. To do so a truncated Galerkin basis set is formed. A suucient number of functions must be included in this Galerkin basis...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Foundations of Computational Mathematics

سال: 2021

ISSN: ['1615-3383', '1615-3375']

DOI: https://doi.org/10.1007/s10208-021-09494-z